Borel structurability on the 2-shift of a countable group

نویسندگان

  • Brandon Seward
  • Robin D. Tucker-Drob
چکیده

We show that for any infinite countable group G and for any free Borel action G y X there exists an equivariant class-bijective Borel map from X to the free part Free(2G) of the 2-shift G y 2G. This implies that any Borel structurability which holds for the equivalence relation generated by Gy Free(2G) must hold a fortiori for all equivalence relations coming from free Borel actions of G. A related consequence is that the Borel chromatic number of Free(2G) is the maximum among Borel chromatic numbers of free actions of G. This answers a question of Marks. Our construction is flexible and, using an appropriate notion of genericity, we are able to show that in fact the generic G-equivariant map to 2G lands in the free part. As a corollary we obtain that for every > 0, every free p.m.p. action of G has a free factor which admits a 2-piece generating partition with Shannon entropy less than . This generalizes a result of Danilenko and Park. Borel structurability on the 2-shift of a countable group Brandon Seward∗ University of Michigan†, Robin D. Tucker-Drob‡ Rutgers University§

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structurable equivalence relations

For a class K of countable relational structures, a countable Borel equivalence relation E is said to be K-structurable if there is a Borel way to put a structure in K on each E-equivalence class. We study in this paper the global structure of the classes of K-structurable equivalence relations for various K. We show that K-structurability interacts well with several kinds of Borel homomorphism...

متن کامل

Uniformity, Universality, and Computability Theory

We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened ...

متن کامل

Finite Generators for Countable Group Actions in the Borel and Baire Category Settings

For a continuous action of a countable discrete group G on a Polish space X, a countable Borel partition P of X is called a generator if GP ∶= {gP ∶ g ∈ G,P ∈ P} generates the Borel σ-algebra of X. For G = Z, the Kolmogorov–Sinai theorem gives a measuretheoretic obstruction to the existence of finite generators: they do not exist in the presence of an invariant probability measure with infinite...

متن کامل

Products of the Universal Treeable Relation, I

(see Hjorth-Kechris [96], Jackson-Kechris-Louveau [00]) and, before the results in Adams-Kechris [00], this gave the only examples of distinct (up to ∼B) non-smooth countable Borel equivalence relations, 4 of them to be exact. In this note, we point out that there is in fact one more strict inequality in the above chain, thereby establishing a 5th distinct example in that list. Theorem 1 E∞T ×E...

متن کامل

ar X iv : 1 30 6 . 12 70 v 1 [ m at h . L O ] 6 J un 2 01 3 UNIVERSAL COUNTABLE BOREL QUASI - ORDERS

In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the quasi-order of Borel reducibility. Following the approach of Louveau and Rosendal for the study of analytic equivalence relations, we study countable Borel qua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 167  شماره 

صفحات  -

تاریخ انتشار 2016